A generalized discrepancy and quadrature error bound
نویسندگان
چکیده
منابع مشابه
A generalized discrepancy and quadrature error bound
An error bound for multidimensional quadrature is derived that includes the Koksma-Hlawka inequality as a special case. This error bound takes the form of a product of two terms. One term, which depends only on the integrand, is defined as a generalized variation. The other term, which depends only on the quadrature rule, is defined as a generalized discrepancy. The generalized discrepancy is a...
متن کاملError Bound of Certain Gaussian Quadrature Rules for Trigonometric Polynomials
In this paper we give error bound for quadrature rules of Gaussian type for trigonometric polynomials with respect to the weight function w(x) = 1+cosx, x ∈ (−π, π), for 2π-periodic integrand, analytic in a circular domain. Obtained theoretical bound is checked and illustrated on some numerical examples.
متن کاملA LeVeque-type Lower Bound for Discrepancy
A sharp lower bound for discrepancy on R/Z is derived that resembles the upper bound due to LeVeque. An analogous bound is proved for discrepancy on R/Z. These are discussed in the more general context of the discrepancy of probablity measures. As applications, the bounds are applied to Kronecker sequences and to a random walk on the torus.
متن کاملDiscrepancy in generalized arithmetic progressions
Estimating the discrepancy of the set of all arithmetic progressions in the first N natural numbers was one of the famous open problem in combinatorial discrepancy theory for a long time, successfully solved by K. Roth (lower bound) and Beck (upper bound). They proved that D(N) = minχ maxA | ∑ x∈A χ(x)| = Θ(N1/4), where the minimum is taken over all colorings χ : [N ] → {−1, 1} and the maximum ...
متن کاملAdaptation Based on Generalized Discrepancy
We present a new algorithm for domain adaptation improving upon a discrepancy minimization algorithm, (DM), previously shown to outperform a number of algorithms for this problem. Unlike many previously proposed solutions for domain adaptation, our algorithm does not consist of a fixed reweighting of the losses over the training sample. Instead, the reweighting depends on the hypothesis sought....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation of the American Mathematical Society
سال: 1998
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-98-00894-1